package leetcode.题库.动态规划;

/**
 * @author: yan
 * @description: 表现良好的最长时间段
 * @create: 2023-02-14 16:13
 **/
public class Solution1124 {
    public static void main(String[] args) {
        int[] arr = new int[]{6,6,9};
        System.out.println(longestWPI(arr));
    }
    public static int longestWPI(int[] hours) {
        return 0;
    }
}
